Are there Irreducibly Relational Facts?
نویسنده
چکیده
If the former is the case, let us say that anti-reductionism about relational facts is true; if the latter, that reductionism about relational facts is true. Let us say that a fact is relational if it makes true some relational proposition (a proposition that asserts that a relation holds between some objects1), that it is irreducibly relational if, in addition, it does not make true any nonrelational propositions, and that it is monadic if it is not irreducibly relational (if it makes true some proposition that does not assert that a relation holds between some objects).
منابع مشابه
Being Realistic about Reasons
In my first lecture I listed seven questions about reasons that seemed to require answers. These were: Relational Character: Reasons are reasons for an agent. How is this relational character to be understood? Ground of Truth: In virtue of what are claims about reasons true, when they are true? Does the idea that claims about reasons are true or false, independent of our opinions about them, an...
متن کاملExtending the Qualitative Trajectory Calculus Based on the Concept of Accessibility of Moving Objects in the Paths
Qualitative spatial representation and reasoning are among the important capabilities in intelligent geospatial information system development. Although a large contribution to the study of moving objects has been attributed to the quantitative use and analysis of data, such calculations are ineffective when there is little inaccurate data on position and geometry or when explicitly explaining ...
متن کاملScalable Relational Learning for Sparse and Incomplete Domains
The Semantic Web (SW) presents new challenges to statistical relational learning. One of the main features of SW data is that it is notoriously incomplete. Consider friend-of-a-friend (FOAF) data. The purpose of the FOAF project is to create a web of machinereadable pages describing people, their relationships, and people’s activities and interests, using SW technology. Obviously people vary in...
متن کاملA Paraconsistent Relational Data Model
IntroductIon Typically, relational databases operate under the Closed World Assumption (CWA) of Reiter (Reiter, 1987). The CWA is a metarule that says that given a knowledge base KB and a sentence P, if P is not a logical consequence of KB, assume ~P (the negation of P). Thus, we explicitly represent only positive facts in a knowledge base. A negative fact is implicit if its positive counterpar...
متن کاملExplicit Negation in Relational
Negative facts in relational databases have traditionally been inferred using the closed world assumption. There are situations where this is not appropriate. We need to resort to the open world assumption, where the negative facts are sometimes explicitly stated. We present a formalism which is capable of answering queries in the relational database context under the open world assumption. We ...
متن کامل